WORST_CASE(?,O(n^1)) Solution: --------- "0" :: [] -(0)-> "A"(15) "0" :: [] -(0)-> "A"(6) "activate" :: ["A"(15)] -(6)-> "A"(2) "add" :: ["A"(15) x "A"(15)] -(12)-> "A"(2) "cons" :: ["A"(0) x "A"(15)] -(15)-> "A"(15) "cons" :: ["A"(0) x "A"(2)] -(2)-> "A"(2) "from" :: ["A"(12)] -(15)-> "A"(2) "fst" :: ["A"(15) x "A"(15)] -(3)-> "A"(2) "len" :: ["A"(15)] -(12)-> "A"(2) "n__add" :: ["A"(15) x "A"(15)] -(15)-> "A"(15) "n__add" :: ["A"(2) x "A"(2)] -(2)-> "A"(2) "n__from" :: ["A"(15)] -(15)-> "A"(15) "n__from" :: ["A"(2)] -(2)-> "A"(2) "n__fst" :: ["A"(15) x "A"(15)] -(0)-> "A"(15) "n__fst" :: ["A"(2) x "A"(2)] -(0)-> "A"(2) "n__fst" :: ["A"(10) x "A"(10)] -(0)-> "A"(10) "n__len" :: ["A"(15)] -(15)-> "A"(15) "n__len" :: ["A"(2)] -(2)-> "A"(2) "n__len" :: ["A"(3)] -(3)-> "A"(3) "nil" :: [] -(0)-> "A"(15) "nil" :: [] -(0)-> "A"(12) "s" :: ["A"(15)] -(15)-> "A"(15) "s" :: ["A"(3)] -(3)-> "A"(3) "s" :: ["A"(2)] -(2)-> "A"(2) Cost Free Signatures: --------------------- "0" :: [] -(0)-> "A"_cf(0) "activate" :: ["A"_cf(0)] -(0)-> "A"_cf(0) "add" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0) "cons" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0) "from" :: ["A"_cf(0)] -(0)-> "A"_cf(0) "fst" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0) "len" :: ["A"_cf(0)] -(0)-> "A"_cf(0) "n__add" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0) "n__from" :: ["A"_cf(0)] -(0)-> "A"_cf(0) "n__fst" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0) "n__len" :: ["A"_cf(0)] -(0)-> "A"_cf(0) "nil" :: [] -(0)-> "A"_cf(0) "s" :: ["A"_cf(0)] -(0)-> "A"_cf(0) Base Constructors: ------------------ "\"0\"_A" :: [] -(0)-> "A"(1) "\"cons\"_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1) "\"n__add\"_A" :: ["A"(0) x "A"(0)] -(1)-> "A"(1) "\"n__from\"_A" :: ["A"(0)] -(1)-> "A"(1) "\"n__fst\"_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(1) "\"n__len\"_A" :: ["A"(0)] -(1)-> "A"(1) "\"nil\"_A" :: [] -(0)-> "A"(1) "\"s\"_A" :: ["A"(1)] -(1)-> "A"(1)